New constructions of non-adaptive and error-tolerance pooling designs

We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be -error-detecting and thus -error-correcting, where , a positive integer, is the maximum number of defectives (or positives). Hence, the number of errors which can be detected grows linearly with the number of positives. Also, this construction induces a construction of a binary code with minimum Hamming distance at least . The second design is the -analogue of a known construction on -disjunct matrices.